Derived Semidistributive Lattices

نویسنده

  • Luigi Santocanale
چکیده

Let C(L) denote the set of covers of a poset L: γ ∈ C(L) if and only γ = (γ0, γ1) ∈ L×L and the interval {x | γ0 ≤ x ≤ γ1 } is a two elements poset. If L is a lattice then there is a natural ordering of C(L): γ ≤ δ if and only if γ0 ≤ δ0, γ1 6≤ δ0, and γ1 ≤ δ1. That is, γ ≤ δ if and only if the cover γ transposes up to δ. For α ∈ C(L) let C(L,α) denote the component of the poset C(L) connected to α. For example, if L is finite join semidistributive and α = (j∗, j) for a join irreducible j and its unique lower cover j∗, then C(L,α) = {β |α ≤ β }. The main result we wish to present is the following:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding Finite Lattices into Finite Biatomic Lattices

For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above for C being, respectively, — The class of all finite lattices; — The class of all finite lower bounded lattices (solved by the first author’s earlier work). — The class of all finite join-semidistributive lattices (th...

متن کامل

Algorithms for k-meet-semidistributive lattices

In this paper we consider k-meet-semidistributive lattices and we are interested in the computation of the set-colored poset associated to an implicational base. The parameter k is of interest since for any nite lattice L there exists an integer k for which L is k-meetsemidistributive. When k = 1 they are known as meet-semidistributive lattices. We rst give a polynomial time algorithm to comput...

متن کامل

2 2 Ja n 20 05 EMBEDDING FINITE LATTICES INTO FINITE BIATOMIC LATTICES

For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above for C being, respectively, — The class of all finite lattices; — The class of all finite lower bounded lattices (solved by the first author's earlier work). — The class of all finite join-semidistributive lattices (th...

متن کامل

From Join-irreducibles to Dimension Theory for Lattices with Chain Conditions

For a finite lattice L, the congruence lattice ConL of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation DL on J(L). We establish a similar version of this result for the dimension monoid DimL of L, a natural precursor of ConL. For L join-semidistributive, this result takes the following form: Theorem 1. Let L be a fi...

متن کامل

Minimum Implicational Basis for -Semidistributive Lattices

For a ∧-semidistributive lattice L, we study some particular implicational systems and show that the cardinality of a minimum implicational basis is polynomial in the size of join-irreducible elements of the lattice L. We also provide a polynomial time algorithm to compute a minimum implicational basis for L. © 2006 Published by Elsevier B.V.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007